On Flow Equivalence of Sofic Shifts
نویسندگان
چکیده
The flow equivalence of sofic shifts is examined using results about the structure of the corresponding covers. A canonical cover generalising the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used to find the range of a flow invariant and to investigate the ideal structure of the universal C∗-algebras associated to sofic shifts. The right Fischer covers of sofic beta-shifts are constructed, and it is proved that the covering maps are always 2 to 1. This is used to construct the corresponding fiber product covers and to classify these up to flow equivalence. Additionally, the flow equivalence of renewal systems is studied, and several partial results are obtained in an attempt to find the range of the Bowen-Franks invariant over the set of renewal systems of finite type. In particular, it is shown that the Bowen-Franks group is cyclic for every member of a class of renewal systems known to attain all entropies realised by shifts of finite type. The following is a Danish translation of the abstract as required by the rules of the University of Copenhagen.
منابع مشابه
A categorical invariant of flow equivalence of shifts
We prove that the Karoubi envelope of a shift — defined as the Karoubi envelope of the syntactic semigroup of the language of blocks of the shift — is, up to natural equivalence of categories, an invariant of flow equivalence. More precisely, we show that the action of the Karoubi envelope on the Krieger cover of the shift is a flow invariant. An analogous result concerning the Fischer cover of...
متن کاملA hierarchy of shift equivalent sofic shifts
We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts. We prove that these classes define invariants shift equivalence (and thus for conjugacy). Finally, we...
متن کاملThe Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence
We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.
متن کاملIsomorphism invariants for actions of sofic groups
For every countable group G, a family of isomorphism invariants for measurepreserving G-actions on probability spaces is defined. In the special case in which G is a countable sofic group, a special class of these invariants are computed exactly for Bernoulli systems over G. This leads to a complete classification of Bernoulli systems for many countable groups including all finitely generated l...
متن کاملThe Work of Kim and Roush in Symbolic Dynamics
Contents 1. Introduction 1 2. Decidability results 1 3. Shift and strong shift equivalence for Boolean matrices 3 4. Strong shift equivalence of positive matrices over subrings of R 4 5. Automorphisms of the shift 4 6. The nonzero spectra of nonnegative integral matrices 6 7. The classification problem for shifts of finite type 6 8. Classification of free Z p actions on mixing SFTs 7 9. Topolog...
متن کامل